package com.cjm.algorithm.leetcode;

public class MinPathSum64 {
    public static int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m + 1][n + 1];
        // 初始化 dp[]
        for (int i = 0; i < dp.length; i++) dp[i][0] = Integer.MAX_VALUE;
        for (int j = 0; j < dp[0].length; j++) dp[0][j] = Integer.MAX_VALUE;
        dp[0][1] = 0;
        dp[1][0] = 0;

        for (int i = 1; i < dp.length; i++) {
            for (int j = 1; j < dp[0].length; j++) {
                dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i - 1][j - 1];
            }
        }
        return dp[m][n];
    }

    public static void main(String[] args) {
        int[][] temp = {{1, 3, 1}, {1, 5, 1}, {4, 2, 1}};
        int i = minPathSum(temp);
        System.err.println(i);
    }
}
